1671A - String Building - CodeForces Solution

implementation

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
	s = input()
	f = 0
	cnt, curr = 1, s[0]
	for i in range(1, len(s)):
		if(s[i]==curr):
			cnt+=1
		else:
			if(cnt<=1):
				f=1
				break
			cnt = 1
			curr = s[i]
	if(cnt<=1):
		f=1
		
	if(f==1):
		print("NO")
	else:
		print("YES")

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        string s;
        cin>>s;
        s+='c';
        //cout<<s<<endl;
        bool tell=true;
        int cnt=1;
        for(int i=0;i<s.length()-1;i++)
        {
            if(s[i]==s[i+1])
            {
                cnt++;
            }
            else
            {
                //cout<<cnt<<endl;
                if(cnt!=1)
                {
                    cnt=1;
                    continue;
                }
                else
                {
                    tell =false;
                    break;
                }
            }
        }
        if(tell) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;

}
}


Comments

Submit
0 Comments
More Questions

1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals